Offline List Update is NP-Hard
نویسنده
چکیده
In the offline list update problem, we maintain an unsorted linear list used as a dictionary. Accessing the item at position i in the list costs i units. In order to reduce access cost, we are allowed to update the list at any time by transposing consecutive items at a cost of one unit. Given a sequence of requests one has to serve in turn, we are interested in the minimal cost needed to serve all requests. Little is known about this problem. The best algorithm so far needs exponential time in the number of items in the list. We show that there is no polynomial algorithm unless P NP.
منابع مشابه
An Optimal Offline Algorithm for List Update
For the static list update problem, given an ordered list ρ0 (an ordering of the list L = { aa, a2, ..., al }), and a sequence σ = (σ1, σ2, ..., σm) of requests for items in L, we characterize the list reorganizations in an optimal offline solution in terms of an initial permutation of the list followed by a sequence of m element transfers, where an element transfer is a type of list reorganiza...
متن کاملList Update Problem
We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.
متن کاملList Update Problem by Béla Csaba
We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.
متن کاملAn on-line approach to hybrid flow shop scheduling with jobs arriving over time
During the manufacturing process in a steel mill, the chemical composition and quality of raw-iron, steel and slack has to be checked several times. The organization of the corresponding list of operations can be classified as a hybrid flow shop scheduling problem with jobs arriving over time and the objective is to minimize the total weighted completion time. Since this problem is known to be ...
متن کاملOff-Line Algorithms for the List Update Problem
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to an implementation of an optimumalgorithm which runs in time O(2 n n!m), where n is the length of the list and m is the number or requests. The previous best algorith...
متن کامل